Population Games on Dynamic Community Networks

نویسندگان

چکیده

In this letter, we deal with evolutionary game-theoretic learning processes for population games on networks dynamically evolving communities. Specifically, propose a novel mathematical framework in which deterministic, continuous-time replicator equation community network is coupled closed dynamic flow process between communities, turn governed by an environmental feedback mechanism. When such mechanism independent of the process, closed-loop system differential equations obtained. Through direct analysis system, study its asymptotic behavior. prove that, if converges, it converges to (possibly restricted) Nash equilibrium game, even when does not converge. Moreover, class games-two-strategy matrix games-a Lyapunov argument employed establish folk theorem that guarantees convergence subset equilibria, is, stable states game. Numerical simulations are provided illustrate and corroborate our findings.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Games on dynamic networks: routing and connectivity

In nite games are a strong model for analyzing dynamic networks that encounter continuous topological changes during operation. In this framework, the players represent the contrary forces which modify the network. In particular, this thesis deals with three di erent two-player games which focus on guaranteeing routing and connectivity properties in dynamic networks. In each model, one player h...

متن کامل

Public good games on dynamic networks

Axelrod (The evolution of cooperation, 1984) and others explain how cooperation can emerge in repeated 2-person prisoner’s dilemmas. But in public good games with anonymous contributions, we expect a breakdown of cooperation because direct reciprocity fails. However, if agents are situated in a social network determining which agents interact, and if they can influence the network, then coopera...

متن کامل

Dynamic interdiction games on PERT networks

In a PERT network interdiction game one player tries to get a project, represented as a PERT graph, finished as quickly as possible by allocating resources, expediting the project’s tasks and choosing between different technologies to use. At the same time a second player aims to maximally delay the project’s completion date by carefully choosing which tasks to disrupt. We develop a novel conti...

متن کامل

Connectivity games over dynamic networks

A game-theoretic model for the study of dynamic networks is analyzed. The model is motivated by communication networks that are subject to failure of nodes and where the restoration needs resources. The corresponding two-player game is played between “Destructor” (who can delete nodes) and “Constructor” (who can restore or even create nodes under certain conditions). We also include the feature...

متن کامل

Dynamic system of strategic games

Maybe an event can't be modeled completely through one game but there is more chance with several games. With emphasis on players' rationality, we present new properties of strategic games, which result in production of other games. Here, a new attitude to modeling will be presented in game theory as dynamic system of strategic games and its some applications such as analysis of the clash betwe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Control Systems Letters

سال: 2022

ISSN: ['2475-1456']

DOI: https://doi.org/10.1109/lcsys.2022.3174916